Analysis on the Algebraic Decoding of the (31, 16, 7) QR Code by Using IFBM Algorithm
نویسنده
چکیده
An analysis on the algebraic decoding of the (31, 16, 7) quadratic residue (QR) code with reducib le generator polynomial that uses the inverse-free Berlekamp-Massey (IFBM) algorithm to determine the error-locator polynomial is presented in this paper. The primary known syndrome S1 will be equal to zero for some weight-3 error patterns. However, the zero S1 does not cause a decoding failure while using the IFBM algorithm to determine the error-locator polynomial. Two examples with detailed step-by-step analysis show the decoding procedure.
منابع مشابه
New Algebraic Decoding of (17,9,5) Quadratic Residue Code by using Inverse Free Berlekamp-Massey Algorithm (IFBM)
In this paper a new algebraic decoding approach for (17,9,5) Quadratic Residue Code is proposed by using the Inverse Free Berlekamp-MasseyAlgorithm i.e. IFBM algorithm. By using an efficient algorithm an unknown syndrome are also developed in this paper. With the help of unknown syndromes, we achieve the alternative consecutive syndromes which are needed for the application of the Berlekamp-Mas...
متن کاملA Viewpoint on the Decoding of the Quadratic Residue Code of Length 89
A viewpoint on the weight-6 error patterns of the algebraic decoding of the (89, 45, 17) quadratic residue (QR) code with reducible generator polynomial, proposed by Truong et al. (2008), is presented in this paper. Some weight-6 error patterns will cause a zero value in the syndrome S1. However, in this case, the inverse-free Berlekamp-Massey (IFBM) algorithm is still valid to determine the er...
متن کاملFast algorithm for decoding of systematic quadratic residue codes
A general algorithm for decoding the binary systematic quadratic residue (QR) codes with lookup tables is presented in this study. The algorithm can be applied in decoding the QR codes with either reducible or irreducible generator polynomials. If the generator polynomial of the QR codes is reducible, the number of elements in the Galois field is less than the sum of all correctable error patte...
متن کاملDecoding of the Triple-Error-Correcting Binary Quadratic Residue Codes
In this paper, a more efficient syndrome-weight decoding algorithm (SWDA), called the enhanced syndrome-weight decoding algorithm (ESWDA), is presented to decode up to three possible errors for the binary systematic (23, 12, 7) and (31, 16, 7) quadratic residue (QR) codes. In decoding of the QR codes, the evaluation of the error-locator polynomial in the finite field is complicated and time-con...
متن کاملAlgebraic Decoding of Quadratic Residue Codes Using Berlekamp-Massey Algorithm
In this paper, an algebraic decoding method is proposed for the quadratic residue codes that utilize the Berlekamp-Massey algorithm. By a modification of the technique developed by He et al., one can express the unknown syndromes as functions of the known syndromes. The unknown syndromes are determined by an efficient algorithm also developed in this paper. With the appearance of unknown syndro...
متن کامل